Descent distribution on Catalan words avoiding a pattern of length at most three
نویسندگان
چکیده
Catalan words are particular growth-restricted words over the set of non-negative integers, and they represent still another combinatorial class counted by the Catalan numbers. We study the distribution of descents on the sets of Catalan words avoiding a pattern of length at most three: for each such a pattern p we provide a bivariate generating function where the coefficient of xy in its series expansion is the number of length n Catalan words with k descents and avoiding p. As a byproduct, we enumerate the set of Catalan words avoiding p, and we provide the popularity of descents on this set. Some of the obtained enumerating sequences are not yet recorded in the On-line Encyclopedia of Integer Sequences.
منابع مشابه
Pattern avoidance and RSK-like algorithms for alternating permutations and Young tableaux
We define a class Ln,k of permutations that generalizes alternating (up-down) permutations. We then give bijective proofs of certain pattern-avoidance results for this class. The bijections employed include are a modified form of the RSK insertion algorithm and a different bijection with RSK-like properties. As a special case of our results, we give two bijections between the set A2n(1234) of a...
متن کاملExtended pattern avoidance
A 0-1 matrix is said to be extendably-avoiding if it can be the upper left corner of a-avoiding permutation matrix. This concept arose in EL], where the surprising result that the number of extendably 321-avoiding rectangles are enumerated by the ballot numbers was proved. Here we study the other ve patterns of length three. The main result is that the six patterns of length three divides into ...
متن کاملPermutations Avoiding a Pair of Generalized Patterns of Length Three with Exactly One Adjacent Pair of Letters
Abstract. In [1] Babson and Steingŕımsson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Claesson [2] presented a complete solution for the number of permutations avoiding any single (generalized) pattern of length three with exactly one adjacent pair of letters. For eight of these twelve pattern...
متن کاملSymmetric Permutations Avoiding Two Patterns ∗
Symmetric pattern-avoiding permutations are restricted permutations which are invariant under actions of certain subgroups of D4, the symmetry group of a square. We examine pattern-avoiding permutations with 180◦ rotational-symmetry. In particular, we use combinatorial techniques to enumerate symmetric permutations which avoid one pattern of length three and one pattern of length four. Our resu...
متن کاملMore restrictive Gray codes for some classes of pattern avoiding permutations
In a recent article [11], Dukes, Flanagan, Mansour and Vajnovszki present Gray codes for several families of pattern avoiding permutations. In their Gray codes two consecutive objects differ in at most four or five positions, which is not optimal. In this paper, we present a unified construction in order to refine their results (or to find other Gray codes). In particular, we obtain more restri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018